GATE CSE 2014 SET-3


Q51.

Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below. T1 : r1(x); r1(Z) ; w1(x); w1(Z) T2 : r2(x); r2(Z); w2(Z) T3 : r3(x); r3(x); w3(Y) S1: r1(x); r3(Y); r3(x); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z); w1(x); w1(Z) S2: r1(x); r3(Y); r2(Y); r3(x); r1(Z); r2(Z); w3(Y); w1(x); w2(Z); w1(Z) Which one of the following statements about the schedules is TRUE?
GateOverflow

Q52.

Which one of the following problems is undecidable?
GateOverflow

Q53.

Let \Sigma be a finite non-empty alphabet and let 2^{\Sigma^{*}} be the power set of \Sigma^{*} . Which one of the following is TRUE?
GateOverflow

Q54.

The above synchronous sequential circuit built using JK flip-flops is initialized with Q_{2}Q_{1}Q_{0} = 000. The state sequence for this circuit for the next 3 clock cycles is
GateOverflow